A Parallel Implementation of the Gustafson-Kessel Clustering Algorithm with CUDA
نویسندگان
چکیده
منابع مشابه
Type-2 Projected Gustafson-Kessel Clustering Algorithm
We propose a type-2 based clustering algorithm to capture data points and attributes relationship embedded in fuzzy subspaces. It is a modification of Gustafson Kessel clustering algorithm through deployment of type-2 fuzzy sets for high dimensional data. The experimental results have shown that type-2 projected GK algorithm perform considerably better than the comparative techniques. General T...
متن کاملRecursive clustering based on a Gustafson-Kessel algorithm
In this paper an on-line fuzzy identification of Takagi Sugeno fuzzy model is presented. The presented method combines a recursive Gustafson–Kessel clustering algorithm and the fuzzy recursive least squares method. The on-line Gustafson–Kessel clustering method is derived. The recursive equations for fuzzy covariance matrix, its inverse and cluster centers are given. The use of the method is pr...
متن کاملGustafson-Kessel-like clustering algorithm based on typicality degrees
Typicality degrees were defined in supervised learning as a tool to build characteristic representatives for data categories. In this paper, an extension of these typicality degrees to unsupervised learning is proposed to perform clustering. The proposed algorithm constitutes a GustafsonKessel variant and makes it possible to identify ellipsoidal clusters with robustness as regards outliers.
متن کاملContext-Based Gustafson-Kessel Clustering with Information Granules
In this paper, we propose a Context-based Gustafson-Kessel (CGK) clustering that builds Information Granulation (IG) in the form of fuzzy set. The fundamental idea of this clustering is based on Conditional Fuzzy C-Means (CFCM) clustering introduced by Pedrycz. The proposed clustering develops clusters preserving homogeneity of the clustered patterns associated with the input and output space. ...
متن کاملApplication of Gustafson-Kessel clustering algorithm in the pattern recognition for GIS
This paper simulates four typical defects in GIS for PD detection, and uses the pulse, amplitude, phase and number of PD to form the three-dimensional PQN matrix. Based on the PQN, three two-dimensional distributions of Hqmax~Phi, Hqmean~Phi and Hn~Phi can be achieved. Then the new G-K clustering method is introduced to separate the four different defects according to the parameters of Sk, Ku, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2012
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e95.d.1162